Strong edge-colouring and induced matchings
نویسندگان
چکیده
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of three edges uses three colours. An induced matching of a graph G is a subset I of edges of G such that the graph induced by the endpoints of I is a matching. In this paper, we prove the NP-completeness of strong 4, 5, and 6-edge-colouring and maximum induced matching in some subclasses of subcubic triangle-free planar graphs. We also obtain a tight upper bound for the minimum number of colours in a strong edge-colouring of outerplanar graphs as a function of the maximum degree.
منابع مشابه
Perfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملStrong edge-colouring of sparse planar graphs
A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum degree∆ has a strong edge-colouring with at most 4∆ + 4 colours. We show that 3∆ + 1 colours suffice if the graph has girth 6, and 4∆ colours suffice if ∆ ≥ 7 or the girth is at least 5. In the last part of the paper, we raise some questions ...
متن کاملEdge Cover Colouring Versus Minimum Degree in Multigraphs
An edge colouring of a multigraph can be thought of as a partition of the edges into matchings (a matching meets each vertex at most once). Analogously, an edge cover colouring is a partition of the edges into edge covers (an edge cover meets each vertex at least once). We aim to determine a tight lower bound on the maximum number of parts in an edge cover colouring as a function of the minimum...
متن کاملOn strong edge-colouring of subcubic graphs
A strong edge-colouring of a graph G is a proper edge-colouring such that every path of length 3 uses three different colours. In this paper we improve some previous results on the strong edgecolouring of subcubic graphs by showing that every subcubic graph with maximum average degree strictly less than 73 (resp. 5 2 , 8 3 , 20 7 ) can be strongly edge-coloured with six (resp. seven, eight, nin...
متن کاملThe strong edge colorings of a sparse random graph
The strong chromatic index of a graph G is the smallest integer k such that the edge set E( G) can be partitioned into k induced subgraphs of G which form matchings. In this paper we consider the behavior of the strong chromatic index of a sparse random graph K (n, p), where p = p(n) = 0(1).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 113 شماره
صفحات -
تاریخ انتشار 2013